L. A. Hemaspaandra: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

On the complexity of graph reconstruction

Dieter Kratsch, Lane A. Hemaspaandra

Journal:

Theory of Computing Systems

Year:

1994

Language:

english

File:

PDF, 942 KB

english, 1994

2

Using complexity to protect elections

Faliszewski, Piotr, Hemaspaandra, Edith, Hemaspaandra, Lane A.

Journal:

Communications of the ACM

Year:

2010

Language:

english

File:

PDF, 1.02 MB

english, 2010

3

Anyone but him: The complexity of precluding an alternative

Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe

Journal:

Artificial Intelligence

Year:

2007

Language:

english

File:

PDF, 291 KB

english, 2007

4

Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe

Journal:

Information Processing Letters

Year:

1998

Language:

english

File:

PDF, 511 KB

english, 1998

5

The complexity of manipulative attacks in nearly single-peaked electorates

Faliszewski, Piotr, Hemaspaandra, Edith, Hemaspaandra, Lane A.

Journal:

Artificial Intelligence

Year:

2014

Language:

english

File:

PDF, 550 KB

english, 2014

6

BANISHING ROBUST TURING COMPLETENESS

HEMASPAANDRA, LANE A., JAIN, SANJAY, VERESHCHAGIN, NIKOLAI K.

Journal:

International Journal of Foundations of Computer Science

Year:

1993

Language:

english

File:

PDF, 805 KB

english, 1993

7

The Price of Universality

Hemaspaandra, Edith

Journal:

Notre Dame Journal of Formal Logic

Year:

1996

Language:

english

File:

PDF, 270 KB

english, 1996

8

High-multiplicity election problems

Fitzsimmons, Zack, Hemaspaandra, Edith

Journal:

Autonomous Agents and Multi-Agent Systems

Year:

2019

Language:

english

File:

PDF, 337 KB

english, 2019

9

Control in the presence of manipulators: cooperative and competitive cases

Fitzsimmons, Zack, Hemaspaandra, Edith, Hemaspaandra, Lane A.

Journal:

Autonomous Agents and Multi-Agent Systems

Year:

2020

File:

PDF, 466 KB

2020

10

Hybrid Elections Broaden Complexity-Theoretic Resistance to Control

Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe

Journal:

Mathematical Logic Quarterly

Year:

2009

Language:

english

File:

PDF, 248 KB

english, 2009

11

P-Selective Sets and Reducing Search to Decision vs Self-Reducibility

Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman

Journal:

Journal of Computer and System Sciences

Year:

1996

Language:

english

File:

PDF, 684 KB

english, 1996

12

Universally Serializable Computation

Lane A. Hemaspaandra, Mitsunori Ogihara

Journal:

Journal of Computer and System Sciences

Year:

1997

Language:

english

File:

PDF, 371 KB

english, 1997

13

Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory

Lane A Hemaspaandra, Jörg Rothe

Journal:

Journal of Computer and System Sciences

Year:

1999

Language:

english

File:

PDF, 129 KB

english, 1999

14

Reducing the Number of Solutions of NP Functions

Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung

Journal:

Journal of Computer and System Sciences

Year:

2002

Language:

english

File:

PDF, 178 KB

english, 2002

15

Census techniques collapse space classes

Edith Hemaspaandra

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 532 KB

english, 1994

16

P-selectivity: Intersections and indices

Lane A. Hemaspaandra, Jiang Zhigen

Journal:

Theoretical Computer Science

Year:

1995

Language:

english

File:

PDF, 645 KB

english, 1995

17

Quasi-injective reductions

Edith Hemaspaandra, Lane A. Hemaspaandra

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 436 KB

english, 1994

18

Optimal advice

Lane A. Hemaspaandra, Leen Torenvliet

Journal:

Theoretical Computer Science

Year:

1996

Language:

english

File:

PDF, 788 KB

english, 1996

19

Reductibility classes of P-selective sets

Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara

Journal:

Theoretical Computer Science

Year:

1996

Language:

english

File:

PDF, 807 KB

english, 1996

20

The consequences of eliminating NP solutions

Piotr Faliszewski, Lane A. Hemaspaandra

Journal:

Computer Science Review

Year:

2008

Language:

english

File:

PDF, 575 KB

english, 2008

21

Complexity results in graph reconstruction

Edith Hemaspaandra, Lane A. Hemaspaandra, Stanisław P. Radziszowski, Rahul Tripathi

Journal:

Discrete Applied Mathematics

Year:

2007

Language:

english

File:

PDF, 267 KB

english, 2007

22

Frequency of correctness versus average polynomial time

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Journal:

Information Processing Letters

Year:

2009

Language:

english

File:

PDF, 139 KB

english, 2009

23

Dichotomy for voting systems

Edith Hemaspaandra, Lane A. Hemaspaandra

Journal:

Journal of Computer and System Sciences

Year:

2007

Language:

english

File:

PDF, 162 KB

english, 2007

24

Generalized modal satisfiability

Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

Journal:

Journal of Computer and System Sciences

Year:

2010

Language:

english

File:

PDF, 526 KB

english, 2010

25

The complexity of Kemeny elections

Edith Hemaspaandra, Holger Spakowski, Jörg Vogel

Journal:

Theoretical Computer Science

Year:

2005

Language:

english

File:

PDF, 209 KB

english, 2005

26

If then some strongly noninvertible functions are invertible

Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe

Journal:

Theoretical Computer Science

Year:

2006

Language:

english

File:

PDF, 199 KB

english, 2006

27

Query-monotonic Turing reductions

Lane A. Hemaspaandra, Mayur Thakur

Journal:

Theoretical Computer Science

Year:

2007

Language:

english

File:

PDF, 779 KB

english, 2007

28

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions

Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena

Journal:

Theoretical Computer Science

Year:

2008

Language:

english

File:

PDF, 382 KB

english, 2008

29

The complexity of power-index comparison

Piotr Faliszewski, Lane Hemaspaandra

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 505 KB

english, 2009

30

Generalized juntas and NP-hard sets

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 406 KB

english, 2009

31

On the complexity of kings

Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe

Journal:

Theoretical Computer Science

Year:

2010

Language:

english

File:

PDF, 1.15 MB

english, 2010

32

On characterizing the existence of partial one-way permutations

Jörg Rothe, Lane A. Hemaspaandra

Journal:

Information Processing Letters

Year:

2002

Language:

english

File:

PDF, 84 KB

english, 2002

33

Characterizing the existence of one-way permutations

Lane A. Hemaspaandra, Jörg Rothe

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 69 KB

english, 2000

34

P-immune sets with holes lack self-reducibility properties

Lane A. Hemaspaandra, Harald Hempel

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 221 KB

english, 2003

35

Boolean operations, joins, and the extended low hierarchy

Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe

Journal:

Theoretical Computer Science

Year:

1998

Language:

english

File:

PDF, 778 KB

english, 1998

36

A second step towards complexity-theoretic analogs of Rice's Theorem

Lane A. Hemaspaandra, Jörg Rothe

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 122 KB

english, 2000

37

Erratum to “Reducibility classes of P-selective sets”: [Theoret. Comput. Sci 155(2) (1996) 447–457]

L. Hemaspaandra, A. Hoene, M. Ogihara

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 37 KB

english, 2000

38

Space-efficient recognition of sparse self-reducible languages

Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda

Journal:

Computational Complexity

Year:

1994

Language:

english

File:

PDF, 2.28 MB

english, 1994

39

The Complexity of Finding Top-Toda-Equivalence-Class Members

Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand

Journal:

Theory of Computing Systems

Year:

2006

Language:

english

File:

PDF, 236 KB

english, 2006

40

Isomorphic Implication

Michael Bauland, Edith Hemaspaandra

Journal:

Theory of Computing Systems

Year:

2009

Language:

english

File:

PDF, 449 KB

english, 2009

41

RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness

E. Hemaspaandra, L. A. Hemaspaandra, H. Hempel

Journal:

Theory of Computing Systems

Year:

1998

Language:

english

File:

PDF, 230 KB

english, 1998

42

Robust Reductions

J.-Y. Cai, L. A. Hemaspaandra, G. Wechsung

Journal:

Theory of Computing Systems

Year:

1999

Language:

english

File:

PDF, 142 KB

english, 1999

43

Easy sets and hard certificate schemes

Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung

Journal:

Acta Informatica

Year:

1997

Language:

english

File:

PDF, 253 KB

english, 1997

44

Guarantees for the success frequency of an algorithm for finding Dodgson-election winners

Christopher M. Homan, Lane A. Hemaspaandra

Journal:

Journal of Heuristics

Year:

2009

Language:

english

File:

PDF, 466 KB

english, 2009

45

Lower bounds and the hardness of counting properties

Lane A. Hemaspaandra, Mayur Thakur

Journal:

Theoretical Computer Science

Year:

2004

Language:

english

File:

PDF, 377 KB

english, 2004

46

All superlinear inverse schemes are coNP-hard

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel

Journal:

Theoretical Computer Science

Year:

2005

Language:

english

File:

PDF, 156 KB

english, 2005

47

Defying Upward and Downward Separation

L.A. Hemaspaandra, S.K. Jha

Journal:

Information and Computation

Year:

1995

File:

PDF, 1.10 MB

1995

48

Almost-Everywhere Superiority for Quantum Polynomial Time

Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand

Journal:

Information and Computation

Year:

2002

Language:

english

File:

PDF, 113 KB

english, 2002

49

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel

Journal:

Information and Computation

Year:

2002

Language:

english

File:

PDF, 107 KB

english, 2002

50

Strong self-reducibility precludes strong immunity

L. A. Hemaspaandra, M. Zimand

Journal:

Theory of Computing Systems

Year:

1996

Language:

english

File:

PDF, 794 KB

english, 1996